Reconnguring Arrays with Faults Part I: Worst-case Faults
نویسندگان
چکیده
In this paper we study the ability of array-based networks to tolerate worst-case faults. We show that an N N two-dimensional array can sustain N 1? worst-case faults, for any xed > 0, and still emulate a fully functioning N N array with only constant slowdown. Previously it was known only that an array could tolerate a constant number of faults with constant slowdown. We also show that if faulty nodes are allowed to communicate, but not compute, then an N-node one-dimensional array can tolerate log O(1) N worst-case faults and still emulate a fault-free array with constant slowdown, and this bound is tight.
منابع مشابه
Reconfiguring Arrays with Faults Part I: Worst-Case Faults
In this paper we study the ability of array-based networks to tolerate worst-case faults. We show that an N × N two-dimensional array can sustain N1− worst-case faults, for any fixed > 0, and still emulate T steps of a fully functioning N × N array in O(T + N) steps, i.e., with only constant slowdown. Previously, it was known only that an array could tolerate a constant number of faults with co...
متن کاملAsymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract)
In the paper, we analyze the computational power of 2 and 3-dimensional processor arrays that contain a potentially large number of faults. We consider both a random a and worst-case fault model, and we prove that in either scenario, low-dimensional arrays are surprisingly fault-tolerant. For example, we show how to emulate an n e x n m fault-free array on an n x n array containing Q(n2) random...
متن کاملA Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches
{ This paper describes a deterministic algorithm for reconnguring a multibutterry network with faulty switches. Unlike previous reconngura-tion algorithms, the algorithm is performed entirely by the network, without the aid of any oo-line computation, even though many of the switches may be faulty. The algorithm reconngures an N-input multibutterry network in O(log N) time. After reconnguratuio...
متن کاملOptimal scheduling of imprecise computation tasks in the presence of multiple faults
With the advance of applications such as multimedia, image/speech processing and real-time AI, real-time computing models allowing to express the “timeliness versus precision” trade-off are becoming increasingly popular. In the Imprecise Computation model, a task is divided into a mandatory part and an optional part. The mandatory part should be completed by the deadline even under worst-case s...
متن کاملART: Robustness of Meshes and Tori for Parallel and Distributed Computation
In this paper, we formulate the array robustness theorems (ARTs) for efficient computation and communication on faulty arrays. No hardware redundancy is required and no assumption is made about the availability of a complete submesh or subtorus. Based on ARTs, a very wide variety of problems, including sorting, FFT, total exchange, permutation, and some matrix operations, can be solved with a s...
متن کامل